Decomposition approaches for recoverable robust optimization problems
نویسندگان
چکیده
منابع مشابه
Decomposition approaches for recoverable robust optimization problems
Real-life planning problems are often complicated by the occurrence of disturbances, which imply that the original plan cannot be followed anymore and some recovery action must be taken to cope with the disturbance. In such a situation it is worthwhile to arm yourself against possible disturbances by including recourse actions in your planning strategy. Well-known approaches to create plans tha...
متن کاملRecoverable robust shortest path problems
Recoverable robustness is a concept to avoid over-conservatism in robust optimization by allowing a limited recovery after the full data is revealed. We investigate two settings of recoverable robust shortest path problems. In both settings the costs of the arcs are subject to uncertainty. For the first setting, at most k arcs of the chosen path can be altered in the recovery. In the second set...
متن کاملRecoverable robust combinatorial optimization problems.dvi
This paper deals with two Recoverable Robust (RR) models for combinatorial optimization problems with uncertain costs. These models were originally proposed by Büsing (2012) for the shortest path problem with uncertain costs. In this paper, we generalize the RR models to a class of combinatorial optimization problems with uncertain costs and provide new positive and negative complexity results ...
متن کاملRobust recoverable and two-stage selection problems
In this paper the following selection problem is discussed. A set of n items is given and we wish to choose a subset of exactly p items of the minimum total cost. This problem is a special case of 0-1 knapsack in which all the item weights are equal to 1. Its deterministic version has a trivial O(n)-time algorithm, which consists in choosing p items of the smallest costs. In this paper it is as...
متن کاملReduction approaches for robust shortest path problems
We investigate the uncertain versions of two classical combinatorial optimization problems, namely the Single-Pair Shortest Path Problem (SP-SPP) and the Single-Source Shortest Path Problem (SS-SPP). The former consists of finding a path of minimum length connecting two specific nodes in a finite directed graph G; the latter consists of finding the shortest paths from a fixed node to the remain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2016
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2015.12.008